A Review paper for Detection of Overlapping Communities in Complex Networks
نویسندگان
چکیده
This paper presents a comprehensive study about different methods which were used to detect the communities in networks. Most of the algorithms were failed to perform in all kind of networks i.e. some perform only in weighted networks, some in bi-partite networks and some in directed networks etc. Label propagation algorithm plays the most effective role in community detection as it takes much less time in comparison of many algorithms. But the main disadvantage of this algorithm is that it fails in finding overlapping communities. Despite of its disadvantages it works as a base method for different algorithms like rank based label propagation algorithm and multiple label propagation approach, which are enhancements in label propagation algorithm. So, there must be an algorithm which can be used in most of the networks and able to detect communities both disjoint and overlapping in less running time. We will try to overcome these problems in our research with the help of label sharing approach.
منابع مشابه
Overlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملA Comprehensive Review of Overlapping Community Detection Algorithms for Social Networks
Community structure is an interesting feature found in many social networks which signifies that there is intense interaction between some individuals. These communities have a tendency to overlap with each other as there are nodes that can belong to multiple communities simultaneously. Detection of such overlapping communities is a challenging task; it still remains a topic of interest for the...
متن کاملIdentifying overlapping communities using multi-agent collective intelligence
The proposed algorithm in this research is based on the multi-agent particle swarm optimization as a collective intelligence due to the connection between several simple components which enables them to regulate their behavior and relationships with the rest of the group according to certain rules. As a result, self-organizing in collective activities can be seen. Community structure is crucial...
متن کامل